A permutation group determined by an ordered set
نویسندگان
چکیده
منابع مشابه
A permutation group determined by an ordered set
Let P be a finite ordered set, and let J(P ) be the distributive lattice of order ideals of P . The covering relations of J(P ) are naturally associated with elements of P ; in this way, each element of P defines an involution on the set J(P ). Let Γ(P ) be the permutation group generated by these involutions. We show that if P is connected then Γ(P ) is either the alternating or the symmetric ...
متن کاملTHESIS FOR THE DEGREE OF DOCTOR OF PHILOSOPHY Permutation patterns, continued fractions, and a group determined by an ordered set
We present six articles: In the first and second article we give the first few results on generalized pattern avoidance, focusing on patterns of type (1, 2) or (2, 1). There are twelve such patterns, and they fall into three classes with respect to being equidistributed. We use 1 23, 1 32, and 2 13 as representatives for these classes. We prove that |Sn(1 23)| = |Sn(1 32)| = Bn and |Sn(2 13)| =...
متن کاملQUASI-PERMUTATION REPRESENTATIONS OF SUZtTKI GROUP
By a quasi-permutation matrix we mean a square matrix over the complex field C with non-negative integral trace. Thus every permutation matrix over C is a quasipermutation matrix. For a given finite group G, let p(G) denote the minimal degree of a faithful permutation representation of G (or of a faithful representation of G by permutation matrices), let q(G) denote the minimal degree of a fai...
متن کاملExtension of Preferences to an Ordered Set
If a decision maker prefers x to y to z, would he choose orderd set [x, z] or [y, x]? This article studies extension of preferences over individual alternatives to an ordered set which is prevalent in closed ballot elections with proportional representation and other real life problems where the decision maker is to choose from groups with an associated hierarchy inside. I introduce five ordina...
متن کاملData Set Editing by Ordered Projection
1 Department of Computer Science. University of Seville. Spain. {aguilar, riquelme, mtoro}@lsi.us.es Abstract. In this paper, an editing algorithm based on the projection of the examples in each dimension is presented. The algorithm, that we have called EOP (Editing by Ordered Projection) has some interesting characteristics: important reduction of the number of examples from the database; lowe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 2003
ISSN: 0012-365X
DOI: 10.1016/s0012-365x(03)00094-3